Field Tests of Kairomones to Increase Parasitism of Spruce Budworm (Lepidoptera: Tortricidae) Eggs by \u3ci\u3eTrichogramma\u3c/i\u3e Spp. (Hymenoptera: Trichogrammatidae)

Hexane extracts of spruce budworm, Choristoneura fumiferana, moth scales, applied at 0.04 moth-gram equivalents/branch and at 0.06 moth-gram equivalents/tree, failed to increase parasitism rates of Trichogramma spp. in two cutover spruce-fir stands in Maine. Releasing Maine-strain T. minutum apparently increased parasitism rates about 20-fold. However, application of kairomone extracts to whole branches and to upper crowns of small trees may have interfered with host-searching behaviors of Trichogramma parasitoids

Ideation as an intellectual information acquisition and use context: Investigating game designers’ information-based ideation behavior

Human Information Behavior (HIB) research commonly examines behavior in the context of why information is acquired and how it will be used, but usually at the level of the work or everyday-life tasks the information will support. HIB has not been examined in detail at the broader contextual level of intellectual purpose (i.e. the higher-order conceptual tasks the information was acquired to support). Examination at this level can enhance holistic understanding of HIB as a ‘means to an intellectual end’ and inform the design of digital information environments that support information interaction for specific intellectual purposes. We investigate information-based ideation (IBI) as a specific intellectual information acquisition and use context by conducting Critical Incident-style interviews with ten game designers, focusing on how they interact with information to generate and develop creative design ideas. Our findings give rise to a framework of their ideation-focused HIB, which systems designers can leverage to reason about how best to support certain behaviors to drive design ideation. These findings emphasize the importance of intellectual purpose as a driver for acquisition and desired outcome of use

Bunch-Kaufman factorization for real symmetric indefinite banded matrices

The Bunch-Kaufman algorithm for factoring symmetric indefinite matrices was rejected for banded matrices because it destroys the banded structure of the matrix. Herein, it is shown that for a subclass of real symmetric matrices which arise in solving the generalized eigenvalue problem using Lanczos's method, the Bunch-Kaufman algorithm does not result in major destruction of the bandwidth. Space time complexities of the algorithm are given and used to show that the Bunch-Kaufman algorithm is a significant improvement over LU factorization

The use of Lanczos's method to solve the large generalized symmetric definite eigenvalue problem

The generalized eigenvalue problem, Kx = Lambda Mx, is of significant practical importance, especially in structural enginering where it arises as the vibration and buckling problem. A new algorithm, LANZ, based on Lanczos's method is developed. LANZ uses a technique called dynamic shifting to improve the efficiency and reliability of the Lanczos algorithm. A new algorithm for solving the tridiagonal matrices that arise when using Lanczos's method is described. A modification of Parlett and Scott's selective orthogonalization algorithm is proposed. Results from an implementation of LANZ on a Convex C-220 show it to be superior to a subspace iteration code

Simulating Electron Transport and Synchrotron Emission in Radio Galaxies: Shock Acceleration and Synchrotron Aging in Three-Dimensional Flows

We present the first three-dimensional MHD radio galaxy simulations that explicitly model transport of relativistic electrons, including diffusive acceleration at shocks as well as radiative and adiabatic cooling in smooth flows. We discuss three simulations of light Mach 8 jets, designed to explore the effects of shock acceleration and radiative aging on the nonthermal particle populations that give rise to synchrotron and inverse-Compton radiations. We also conduct detailed synthetic radio observations of our simulated objects. We have gained several key insights from this approach: 1. The jet head in these multidimensional simulations is extremely complex. The classical jet termination shock is often absent, but motions of the jet terminus spin a ``shock-web complex'' within the backflowing jet material of the head. 2. Understanding the spectral distribution of energetic electrons in these simulations relies partly upon understanding the shock-web complex, for it can give rise to distributions that confound interpretation in terms of the standard model for radiative aging of radio galaxies. 3. The magnetic field outside of the jet itself becomes very intermittent and filamentary in these simulations, yet adiabatic expansion causes most of the cocoon volume to be occupied by field strengths considerably diminished below the nominal jet value. Thus population aging rates vary considerably from point to point.Comment: 44 pages, 6 figures; to be published in the Astrophysical Journal (August 2001); higher-quality figures can be found at http://www.msi.umn.edu/Projects/twj/radjet/radjet.htm

One-loop renormalisation of general N=1/2 supersymmetric gauge theory

We investigate the one-loop renormalisability of a general N=1/2 supersymmetric gauge theory coupled to chiral matter, and show the existence of an N=1/2 supersymmetric SU(N)xU(1) theory which is renormalisable at one loop.Comment: 30 pages, including 8 figures. Plain TeX. Uses Harvmac and eps

Solar radius measurements

Preliminary results of measurements made during 1979-1980 are discussed. Variability in the radius measurements of 0.4 pi is found, of unknown origin

Constrained LQR Using Online Decomposition Techniques

This paper presents an algorithm to solve the infinite horizon constrained linear quadratic regulator (CLQR) problem using operator splitting methods. First, the CLQR problem is reformulated as a (finite-time) model predictive control (MPC) problem without terminal constraints. Second, the MPC problem is decomposed into smaller subproblems of fixed dimension independent of the horizon length. Third, using the fast alternating minimization algorithm to solve the subproblems, the horizon length is estimated online, by adding or removing subproblems based on a periodic check on the state of the last subproblem to determine whether it belongs to a given control invariant set. We show that the estimated horizon length is bounded and that the control sequence computed using the proposed algorithm is an optimal solution of the CLQR problem. Compared to state-of-the-art algorithms proposed to solve the CLQR problem, our design solves at each iteration only unconstrained least-squares problems and simple gradient calculations. Furthermore, our technique allows the horizon length to decrease online (a useful feature if the initial guess on the horizon is too conservative). Numerical results on a planar system show the potential of our algorithm.Comment: This technical report is an extended version of the paper titled "Constrained LQR Using Online Decomposition Techniques" submitted to the 2016 Conference on Decision and Contro